Modular proximal optimization for multidimensional total-variation regularization
نویسندگان
چکیده
One of the most frequently used notions of “structured sparsity” is that of sparse (discrete) gradients, a structure typically elicited through Total-Variation (TV) regularizers. This paper focuses on anisotropic TV-regularizers, in particular on `p-norm weighted TV regularizers for which it develops efficient algorithms to compute the corresponding proximity operators. Our algorithms enable one to scalably incorporate TV regularization of vector, matrix, or tensor data into a proximal convex optimization solvers. For the special case of vectors, we derive and implement a highly efficient weighted 1D-TV solver. This solver provides a backbone for subsequently handling the more complex task of higher-dimensional (two or more) TV by means of a modular proximal optimization approach. We present numerical experiments that demonstrate how our 1D-TV solver matches or exceeds the best known 1D-TV solvers. Thereafter, we illustrate the benefits of our modular design through extensive experiments on: (i) image denoising; (ii) image deconvolution; (iii) four variants of fusedlasso; and (iv) video denoising. Our results show the flexibility and speed our TV solvers offer over competing approaches. To underscore our claims, we provide our TV solvers in an easy to use multi-threaded C++ library (which also aids reproducibility of our results).
منابع مشابه
Model-based iterative tomographic reconstruction with adaptive sparsifying transforms
Model based iterative reconstruction algorithms are capable of reconstructing high-quality images from lowdose CT measurements. The performance of these algorithms is dependent on the ability of a signal model to characterize signals of interest. Recent work has shown the promise of signal models that are learned directly from data. We propose a new method for low-dose tomographic reconstructio...
متن کاملModular Algorithms for Large–Scale Total Variation Image Deblurring
We present the theory behind inverse problems and illustrate that regularization is needed to obtain useful solutions. The most frequently used solution techniques for solving ill–posed problems are based on the use of 2–norms, which are known not to be suitable when edges are desired in the regularized solution. The thesis covers the development of an algorithm for solving ill–posed problems, ...
متن کاملSnake: a Stochastic Proximal Gradient Algorithm for Regularized Problems over Large Graphs
A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over the graph. When applying the proximal gradient algorithm to solve this problem, there exist quite affordable methods to implement the proximity operator (back...
متن کاملFAASTA: A fast solver for total-variation regularization of ill-conditioned problems with application to brain imaging
The total variation (TV) penalty, as many other analysis-sparsity problems, does not lead to separable factors or a proximal operator with a closed-form expression, such as soft thresholding for the l1 penalty. As a result, in a variational formulation of an inverse problem or statistical learning estimation, it leads to challenging non-smooth optimization problems that are often solved with el...
متن کاملMulticontrast MRI Reconstruction with Structure-Guided Total Variation
Magnetic resonance imaging (MRI) is a versatile imaging technique that allows different contrasts depending on the acquisition parameters. Many clinical imaging studies acquire MRI data for more than one of these contrasts—such as for instance T1 and T2 weighted images—which makes the overall scanning procedure very time consuming. As all of these images show the same underlying anatomy one can...
متن کامل